Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

Science in High Magnetic Fields: What Could Be Learned?

High magnetic fields are one of the most powerful tools available to scientists for the study, modification and control of matter. This includes the knowledge on correlations effects, interaction mechanisms, structural information and understanding of mesoscopic effects. In this context, a review of recent scientific achievements at the Grenoble High Magnetic Laboratory is given to illustrate, on specific examples, the power of the Magnetic Field probe.     

H.264变换编码与量化原理分析

详细分析了 H .2 64视频编码标准中的整数变换和量化过程。 H .2 64采用 4× 4整数变换 ,并将尺度调整融合在量化过程中 ,降低变换算法复杂度和减少乘法次数 ,相对于以前的编码标准更加有效     

数学归纳法的几个推广

将通常适用于自然数系的数学归纳法推广到了下有界整数集{n|n∈Z,n≥n0}与上有界整数集{n|n∈Z，n≤m0}及全体整数集Z。并证明了关于命题{P(m,n)}m,n∈z的二元数学归纳法。     

一种改进的交错脉冲解速度模糊方法

研究了脉冲多普勒气象雷达中用于解速度模糊的交错脉冲方法，理论分析了时域脉冲对处理中速度估计公式的局限性，同时对该公式进行了修正。仿真结果表明，改进的交错脉冲方法具有更好的解速度模糊性能，而且易于实时处理。     

基于混沌电路的一种混合噪声调制雷达引信

提出了一种基于混沌电路的随机脉位调制（RPPM）和随机二相码调相（RBCPM）混合调制的雷达引信系统。介绍了该引信波形的数学模型，平均模型函数及引信的实现框图和工作原理，研究了基于混沌电路的混合调制信号的产生方法，这种引信波形不仅具有结构简单和易于处理等特点，而且具有良好的测距和测速性能，以及极低的截获概率和很强的抗干扰特性。     

A New Algorithm for the Elimination of Common Subexpressions in Hardware Implementation of Digital Filters by Using Genetic Programming

A new algorithm based on Genetic Programming (GP) for the problem of optimization of Multiple constant Multiplication (MCM) by Common Subexpression Elimination(CSE) is developed. This method is used for hardware optimization for DSP systems. A solution based on Genetic Programming is shown in this paper. The performance of the technique is demonstrated in one- and multi-dimensional digital filters with constant coefficients.     

A heuristic for the label printing problem

Label printing finds many applications in industry. However, this task is still labor intensive in many printing factories. Since each template can only accommodate a fixed number of labels, an important task is to work out the compositions of templates by allocating suitable labels to each template in order to fulfill the order requirements effectively. The template design could be rather arbitrary, which usually ends up with a lot of excessive printed labels. Enhancing the template design will significantly improve the efficiency of the printing process, and, at the same time, reduce the waste of resources. This motivates the study of more automatic design methods. In this paper, the problem is first formulated as a nonlinear integer programming problem. The main variables in the formulation are the compositions and the printing frequencies of templates. For practical purpose, each type of label is confined to one template only which allows automated packing and handling. The structure of the problems is carefully analyzed and a new algorithm is proposed. Numerical results show that the proposed method is a simple but effective way of generating good template designs.     

一个改进的单抓钩周期性排序模型及其在自动化学处理线中的应用

计算机控制的抓钩广泛用于自动化学处理线的工件的运送。抓钩的排序直接影响系统的生产率，抓钩排序的目标是对运送进行排序以极大化生产率。当某工序处理时间非常长时，该工序成为瓶颈。为了去除该瓶颈，系统可以为该工序设计多个处理槽，这称为“多重处理槽”问题。本文提出一个改进的混合整数规划模型以求解有“多重处理槽”的单抓钩周期性排序问题的最优解。实例表明所提出的方法是有效的。     

Modelling topology optimization problems as linear mixed 0–1 programs

This paper deals with topology optimization of discretized continuum structures. It is shown that a large class of non‐linear 0–1 topology optimization problems, including stress‐ and displacement‐constrained minimum weight problems, can equivalently be modelled as linear mixed 0–1 programs. The modelling approach is applied to some test problems which are solved to global optimality. Copyright © 2003 John Wiley & Sons, Ltd.